perm filename CIRCUM.NOT[F79,JMC] blob sn#646363 filedate 1982-03-12 generic text, type C, neo UTF8
COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	minimizing non-monotonic reasoning
C00004 ENDMK
C⊗;
minimizing non-monotonic reasoning

	It might be worthwhile to write some axioms that minimize
non-monotonic reasoning  - replacing as much as possible by deduction.
The minimum might be a single sentence in memory that is automatically
updated and saying %2Belief-set = '(_..._)%1.  Assuming further that
true LISP syntactic assertions about ⊗Belief-set, e.g. assertions
like (MEMBER '(AT I AIRPORT) BELIEF-SET), can be made at any time
and are automatically added to ⊗belief-set, then everything that can
be done by any effective kind of non-monotonic reasoning can be done
by deductive reasoning plus the automatic updating of ⊗belief-set.  
I don't have a proof of this yet.

1982 Mar 12

	The above is somewhat obscure to me now.  It seems to be worthwhile
to distinguish between positive and negative assertions about the
belief set, i.e. between those which will remain true when the belief
set is extended and those which may not.